A NOTE ON OFF-LINE PERMUTATION ROUTING ON A MESH-CONNECTED PROCESSOR ARRAY
نویسندگان
چکیده
منابع مشابه
A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array
We show how to off-line route any permutation of a n X n meshconnected processor array in 2.5n 3 steps with at most 6 packets per processor per time step and in 2.25n +3 steps with at most 8 packets per processor per time step.
متن کاملOptimal Permutation Routing on Mesh Networks
Permutation routing is used as one of the standard tests of routing algorithms. In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations. Wireless mesh networks are based on plane tessellations that divide t...
متن کاملPermutation Routing on Mesh model Parallel Computers
This paper studies the problems of permutation routing on different mesh models of parallel computation and simulates algorithms for different mesh models using C. Simple algorithms for permutation routing mesh models with and without bus have been considered, analyzed and simulated. In mesh models with bus, models with fixed bus and reconfigurable buses are dealt. For problems in permutation r...
متن کاملA Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کاملInteger sorting on a mesh-connected array of processors
Schnorr and Shamir and independently Kunde, have shown that sorting N = n2 inputs into snake-likeordering on a n X n mesh requires 3n o(n) steps. Using a less restrictive, more realistic model we show that the sorting N = n 2 integers in the range [1 ... N] can be performed in 2n + o(n) steps on a n X n mesh.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 1991
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626491000239